Vertex cover - PDFSEARCH.IO - Document Search Engine

Vertex cover
Results: 204

#	Item
31	CS264: Homework #4 Due by midnight on Wednesday, October 22, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-10-16 11:28:02 NP-complete problems Vertex cover Maximum cut Dynamic programming Algorithm Kernelization Approximation algorithm
32	CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:35:58 NP-complete problems Approximation algorithm Independent set Algorithm Maximal independent set Longest path problem Vertex cover
33	Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2015-01-20 10:45:26 Graph coloring Hypergraphs NP-complete problems Vertex cover Edge coloring Matching Constraint programming ErdsFaberLovsz conjecture Constraint graph
34	IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5, NO. 2, Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2008-04-10 08:31:28 NP-complete problems NP Set cover problem Vertex cover Thorn Approximation algorithm
35	Preventing Unraveling in Social Networks: The Anchored k-Core Problem Kshipra Bhawalkar1 , Jon Kleinberg2 , Kevin Lewi1 , Tim Roughgarden1 , and Aneesh Sharma3 1 Stanford University, Stanford, CA, USA Cornell University, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2013-07-09 15:08:31 Dynamic programming Equations Mathematical optimization Operations research Optimal control Systems engineering Tree HopcroftKarp algorithm Vertex cover
36	CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-28 14:26:27 NP-complete problems Knapsack problem Set cover problem Steiner tree problem Vertex cover Approximation algorithm Greedy algorithm Dynamic programming Minimum spanning tree Algorithm Time complexity NP
37	Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Graph coloring Graph connectivity Combinatorial optimization Matching Vertex cover Bridge Color-coding Treewidth Neighbourhood Covering graph Incidence coloring
38	An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-06-04 05:35:50 NP-complete problems Functional analysis Vertex cover Distribution Graph coloring Dominating set Maximal independent set
39	Workpackage 2. Invariance Properties of Subsystems Chris Cannings & John Haslegrave ,University of Sheffield, UK. EU Report, 12 months HIERATIC Focus on dynamics of games on graphs building on the Add to Reading List Source URL: www.hieratic.eu Language: English Graph theory Vertex Graph Threshold graph Vertex cover
40	Erratum: Long-Range Frustration in a Spin-Glass Model of the Vertex-Cover Problem [Phys. Rev. Lett. 94, Haijun Zhou State Key Laboratory of Theoretical Physics, Institute of Theoretical Physics, Chinese Ac Add to Reading List Source URL: power.itp.ac.cn Language: English - Date: 2012-11-04 02:00:50